Marcinkiewicz-summability of multi-dimensional Fourier transforms and Fourier series

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Summability of Multi-Dimensional Trigonometric Fourier Series

We consider the summability of oneand multi-dimensional trigonometric Fourier series. The Fejér and Riesz summability methods are investigated in detail. Different types of summation and convergence are considered. We will prove that the maximal operator of the summability means is bounded from the Hardy space Hp to Lp, for all p > p0, where p0 depends on the summability method and the dimensio...

متن کامل

l1-summability of higher-dimensional Fourier series

It is proved that the maximal operator of the l1-Fejér means of a d-dimensional Fourier series is bounded from the periodic Hardy space Hp(T ) to L p(T ) for all d/(d+1) < p ≤ ∞ and, consequently, is of weak type (1, 1). As a consequence we obtain that the l1-Fejér means of a function f ∈ L1(T ) converge a.e. to f . Moreover, we prove that the l1-Fejér means are uniformly bounded on the spaces ...

متن کامل

Logarithmic Summability of Fourier Series

A set of regular summations logarithmic methods is introduced. This set includes Riesz and Nörlund logarithmic methods as limit cases. The application to logarithmic summability of Fourier series of continuous and integrable functions are given. The kernels of these logarithmic methods for trigonometric system are estimated.

متن کامل

Discrete–time Fourier Series and Fourier Transforms

We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...

متن کامل

Discrete–time Fourier Series and Fourier Transforms

We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2011

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2011.02.021